منابع مشابه
On the Structure of Metric-like Spaces
The main purpose of this paper is to introduce several concepts of the metric-like spaces. For instance, we define concepts such as equal-like points, cluster points and completely separate points. Furthermore, this paper is an attempt to present compatibility definitions for the distance between a point and a subset of a metric-like space and also for the distance between two subsets of a metr...
متن کاملOn Dimension Partitions in Discrete Metric Spaces
Let (W,d) be a metric space and S = {s1 . . . sk} an ordered list of subsets of W . The distance between p ∈ W and si ∈ S is d(p, si) = min{ d(p, q) : q ∈ si }. S is a resolving set forW if d(x, si) = d(y, si) for all si implies x = y. A metric basis is a resolving set of minimal cardinality, named the metric dimension of (W,d). The metric dimension has been extensively studied in the literatur...
متن کاملOn metric spaces induced by fuzzy metric spaces
For a class of fuzzy metric spaces (in the sense of George and Veeramani) with an H-type t-norm, we present a method to construct a metric on a fuzzy metric space. The induced metric space shares many important properties with the given fuzzy metric space. Specifically, they generate the same topology, and have the same completeness. Our results can give the constructive proofs to some probl...
متن کاملThe metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملModels for the k-metric dimension
For an undirected graph G = (V,E), a vertex τ ∈ V separates vertices u and v (where u, v ∈ V , u 6= v) if their distances to τ are not equal. Given an integer parameter k ≥ 1, a set of vertices L ⊆ V is a feasible solution if for every pair of distinct vertices, u, v, there are at least k distinct vertices τ1, τ2, . . . , τk ∈ L each separating u and v. Such a feasible solution is called a land...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2018
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.1281.c7f